Estimation of Execution Time and Speedup for Bitonic Sorting in Sequential and Parallel Enviroment
نویسندگان
چکیده
The Batcher`s bitonic sorting algorithm is one of the best parallel sorting algorithms, for sorting random numbers in modern parallel machines. Load balancing property of bitonic sorting algorithm makes it unique among other parallel sorting algorithms. Contribution of bitonic sorting algorithm can be seen in various scientific and engineering applications. Research on a bitonic sorting algorithm has been reported by various researchers in order to improve up the performance of initial batcher`s bitonic sorting algorithm. In this paper, time estimation of bitonic sort algorithm is done in both sequential as well as in parallel domain.
منابع مشابه
موازی سازی شبیه سازی پدیده ناپایداری دوجریانی به روش PIC
Two stream instability in plasma is simulated by PIC method. The execution time of the sequential and parallizable sections of the program is measured. The sequential program is parallelized with the help of the MPI functions. Then, the execution time of the sequential program versus the number of the grid points and the execution time of the parallel program on 3 and 5 processors versus the nu...
متن کاملComparison of parallel sorting algorithms
In our study we implemented and compared seven sequential and parallel sorting algorithms: bitonic sort, multistep bitonic sort, adaptive bitonic sort, merge sort, quicksort, radix sort and sample sort. Sequential algorithms were implemented on a central processing unit using C++, whereas parallel algorithms were implemented on a graphics processing unit using CUDA platform. We chose these algo...
متن کاملThe implementation and optimization of Bitonic sort algorithm based on CUDA
This paper describes in detail the bitonic sort algorithm,and implements the bitonic sort algorithm based on cuda architecture.At the same time,we conduct two effective optimization of implementation details according to the characteristics of the GPU,which greatly improve the efficiency. Finally,we survey the optimized Bitonic sort algorithm on the GPU with the speedup of quick sort algorithm ...
متن کاملA Regular N-node Bounded Degree Network for Sorting N 2 Keys with Optimal Speedup
| In this paper we present a new parallel sorting algorithm called Shuue Ring Sort (SRS) for distributed memory systems with a regular bounded degree in-terconnection network. Our algorithm is optimal in the sense that it achieves a time complexity of O(N logN) for sorting at least N 2 keys on N processors. The assumption that the problem size grows at least quadratic with the number of availab...
متن کاملEvaluating Parallel Algorithms Theoretical and Practical Aspects
The motivation for the work reported in this thesis has been to lessen the gap between theory and practice within the eld of parallel computing When looking for new and faster parallel algorithms for use in massively parallel systems it is tempting to investigate promising alternatives from the large body of research done on parallel algorithms within the eld of theoretical computer science The...
متن کامل